Algorithmic Properties of Polynomial Rings

Algorithmic Properties of Polynomial Rings

In this paper we investigate how algorithms for computing heights, radicals, unmixed and primary decompositions of ideals can be lifted from a Noetherian commutative ring R to polynomial rings over R. It is a standard problem in mathematics to study which properties of a mathematical structure are preserved in derived structures. A typical result of this kind is the Hilbert Basis Theorem which ...

Differential Polynomial Rings of Triangular Matrix Rings

An Algorithmic Proof of Suslin’s Stability Theorem over Polynomial Rings

Let k be a field. Then Gaussian elimination over k and the Euclidean division algorithm for the univariate polynomial ring k[x] allow us to write any matrix in SLn(k) or SLn(k[x]), n ≥ 2, as a product of elementary matrices. Suslin’s stability theorem states that the same is true for the multivariate polynomial ring SLn(k[x1, . . . , xm]) with n ≥ 3. As Gaussian elimination gives us an algorith...

differential polynomial rings of triangular matrix rings

Polynomial Rings over Pseudovaluation Rings

Let R be a ring. Let σ be an automorphism of R. We define a σ-divided ring and prove the following. (1) Let R be a commutative pseudovaluation ring such that x ∈ P for any P ∈ Spec(R[x,σ]) . Then R[x,σ] is also a pseudovaluation ring. (2) Let R be a σ-divided ring such that x ∈ P for any P ∈ Spec(R[x,σ]). Then R[x,σ] is also a σ-divided ring. Let now R be a commutative Noetherian Q-algebra (Q i...